Prime divisors of some shifted products

نویسندگان

  • Éric Levieil
  • Florian Luca
  • Igor E. Shparlinski
چکیده

We study prime divisors of various sequences of positive integers A(n) + 1, n = 1,...,N, such that the ratios a(n) = A(n)/A(n − 1) have some number-theoretic or combinatorial meaning. In the case a(n) = n, we obviously have A(n) = n!, for which several new results about prime divisors of n! + 1 have recently been obtained.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

σ-sporadic prime ideals and superficial elements

Let $A$ be a Noetherian ring, $I$ be an ideal of $A$ and $sigma$ be a semi-prime operation, different from the identity map on the set of all ideals of $A$. Results of Essan proved that the sets of associated prime ideals of $sigma(I^n)$, which denoted by $Ass(A/sigma(I^n))$, stabilize to $A_{sigma}(I)$. We give some properties of the sets $S^{sigma}_{n}(I)=Ass(A/sigma(I^n))setminus A_{sigma}(I...

متن کامل

Divisors of Mersenne Numbers By Samuel

We add to the heuristic and empirical evidence for a conjecture of Gillies about the distribution of the prime divisors of Mersenne numbers. We list some large prime divisors of Mersenne numbers Mp in the range 17000 < p < 105.

متن کامل

Some Algorithms for Prime Testing Using Generalized Lehmer Functions

Let N be an odd integer thought to be prime. The properties of special functions which are generalizations of the functions of Lehmer (Ann. of Math., v. 31, 1930, pp. 419-448) are used to develop algorithms that produce information concerning the possible prime divisors of N. It is shown how the factors of N ± 1, N + 1, 2 N ± N + 1, together with the factor bounds on these numbers, may all be u...

متن کامل

On Prime Divisors of Binomial Coefficients

This paper, using computational and theoretical methods, deals with prime divisors of binomial coefficients: Geometric distribution and number of distinct prime divisors are studied. We give a numerical result on a conjecture by Erdôs on square divisors of binomial coefficients.

متن کامل

Small gaps between almost primes, the parity problem and some conjectures of Erdős on consecutive integers

In a previous paper, the authors proved that in any system of three linear forms satisfying obvious necessary local conditions, there are at least two forms that infinitely often assume E2-values; i.e., values that are products of exactly two primes. We use that result to prove that there are inifinitely many integers x that simultaneously satisfy ω(x) = ω(x + 1) = 4,Ω(x) = Ω(x + 1) = 5, and d(...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Int. J. Math. Mathematical Sciences

دوره 2005  شماره 

صفحات  -

تاریخ انتشار 2005